Effective dimensions and percolation in hierarchically structured scale-free networks.
نویسندگان
چکیده
We introduce appropriate definitions of dimensions in order to characterize the fractal properties of complex networks. We compute these dimensions in a hierarchically structured network of particular interest. In spite of the nontrivial character of this network that displays scale-free connectivity among other features, it turns out to be approximately one dimensional. The dimensional characterization is in agreement with the results on statistics of site percolation and other dynamical processes implemented on such a network.
منابع مشابه
Structural Properties of Scale-Free Networks
Many networks have been reported recently to follow a scale-free degree distribution in which the fraction of sites having k connections follows a power law: P (k) = k . In this chapter we study the structural properties of such networks. We show that the average distance between sites in scale-free networks is much smaller than that in regular random networks, and bears an interesting dependen...
متن کاملPercolation transitions in scale-free networks under the Achlioptas process.
It has been recently shown that the percolation transition is discontinuous in Erdos-Rényi networks and square lattices in two dimensions under the Achlioptas process (AP). Here, we show that when the structure is highly heterogeneous as in scale-free networks, a discontinuous transition does not always occur: a continuous transition is also possible depending on the degree distribution of the ...
متن کاملPercolation critical exponents in scale-free networks.
We study the behavior of scale-free networks, having connectivity distribution P(k) approximately k(-lambda), close to the percolation threshold. We show that for networks with 3<lambda<4, known to undergo a transition at a finite threshold of dilution, the critical exponents are different than the expected mean-field values of regular percolation in infinite dimensions. Networks with 2<lambda<...
متن کاملPercolation in self-similar networks
We provide a simple proof that graphs in a general class of self-similar networks have zero percolation threshold. The considered self-similar networks include random scale-free graphs with given expected node degrees and zero clustering, scale-free graphs with finite clustering and metric structure, growing scale-free networks, and many real networks. The proof and the derivation of the giant ...
متن کاملScale-Free properties of weighted random graphs: Minimum Spanning Trees and Percolation
We study Erdös-Rényi random graphs with random weights associated with each link. In our approach, nodes connected by links having weights below the percolation threshold form clusters, and each cluster merges into a single node, thus generating a new “clusters network”. We show that this network is scale-free with λ = 2.5. Furthermore, we show that optimization causes the percolation threshold...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Physical review. E, Statistical, nonlinear, and soft matter physics
دوره 68 5 Pt 2 شماره
صفحات -
تاریخ انتشار 2003